On a Conjecture Concerning Helly Circle Graphs

نویسندگان

  • Guillermo Durán
  • Marina Groshaus
  • Fábio Protti
  • Jayme L. Szwarcfiter
چکیده

We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle), and thus this method provides an analytic way for recognizing circle graphs. Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón I, Ciudad Universitaria (1428), Buenos Aires, Argentina. Partially supported by UBACyT Grants X036 and X127, and PID Conicet Grant 644/98, Argentina. E-mail: [email protected] Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón I, Ciudad Universitaria (1428), Buenos Aires, Argentina. Partially supported by UBACyT Grant X127, Argentina. E-mail: [email protected] Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón I, Ciudad Universitaria (1428), Buenos Aires, Argentina. Partially supported by UBACyT Grant X036, Argentina. E-mail: [email protected] NCE, Universidade Federal do Rio de Janeiro, RJ, Caixa Postal 2324, 20001-970, Brasil. Partially suported by Conselho Nacional de Desenvolvimento Cient́ıfico e Tecnológico, CNPq Brasil. E-mail: [email protected] Universidade Federal do Rio de Janeiro, Instituto de Matemática, NCE and COPPE, Caixa Postal 2324, 20001-970, Rio de Janeiro, RJ, Brasil. Partially supported by the Conselho Nacional de Desenvolvimento Cient́ıfico e Tecnológico CNPq, and Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro FAPERJ, Brasil. E-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New advances about a conjecture on Helly circle graphs

A circle graph is the intersection graph of a set of chords on a circle. A graph is Helly circle if there is a model of chords satisfying the Helly property. In 2003 it was conjectured that Helly circle graphs are exactly diamond-free circle graphs. In this work, we propose a method to compress any Helly circle representation of a graph and give some ideas to advance in an inductive proof of th...

متن کامل

Some new results on circle graphs

Abstract: The intersection graph of a set of chords on a circle is called a circle graph. This class of graphs admits some interesting subclasses, such as: Helly circle graphs, clique-Helly circle graphs, unit circle graphs and proper circular-arc graphs. In this paper, we prove some inclusion relations among these subclasses. A necessary condition for a graph being a Helly circle graph is show...

متن کامل

The intersection between some subclasses of circular-arc and circle graphs

The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. The intersection graph of a family of chords in a circle is called a circle graph. Analogously, this class of graphs admits some subcla...

متن کامل

Normal Helly circular-arc graphs and its subclasses

A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model, and if there are no two arcs covering the circle, thenM is a normal Helly circular-arc model. A Helly (resp. proper Helly, unit Helly, normal He...

متن کامل

Partial Characterizations of Circle Graphs

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

متن کامل

On circular-arc graphs having a model with no three arcs covering the circle

An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the inters...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002